/*
*	ID : Pallab
* 	PROG : D
* 	LANG : C++
* 	2012-11-29-03.58.49 Thursday
*
* 	"I have not failed, I have just found 10000 ways that won't work.
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

inline void wait(double seconds) {
        double endtime = clock() + (seconds * CLOCKS_PER_SEC);
        while (clock() < endtime) {
                ;
        }
}
template<class T>
inline T fastIn() {
    register char c=0;
    register T a=0;
    bool neg=false;
    while(c<33)c=getchar();
    while(c>33) {
        if(c=='-') {
            neg=true;
        } else {
            a= (a*10)+(c-'0');
        }
        c=getchar();
    }
    return neg?-a:a;
}
const int MX = (int)1e5+5;
vector<int> adj[MX];
int node_count;
int edge_count;
int head_count;
int tail_count;
int nodes[MX];
inline void read(){
    node_count=fastIn<int>(),edge_count=fastIn<int>(),head_count=fastIn<int>(),tail_count=fastIn<int>();
    int u,v;
    fo(i,edge_count){
        u=fastIn<int>(),v=fastIn<int>();
        adj[u].pb(v),adj[v].pb(u);
        ++nodes[u];
        ++nodes[v];
    }
}
bool marked1[MX];
bool marked2[MX];
bool used[MX];
inline void proc(){
    foE(h,1,node_count){
        int head_cnt=nodes[h]-1;
        if(head_cnt>=head_count){
            SET(marked1,false);
            for(auto &x:adj[h])marked1[x]=true;

            //possibilities
            for(auto &t:adj[h]){
                int tail_cnt = nodes[t]-1;
                if( tail_cnt>=tail_count){
                    marked1[t]=false;
                    //common
                    SET(marked2,false);
                    int cnt=0;
                    for(auto &x:adj[t])if(marked1[x])marked2[x]=true,++cnt;
                    int total = head_cnt+tail_cnt-cnt;
                    if(total>=head_count+tail_count){
                        cout<<"YES\n"<<h<<' '<<t<<'\n';
                        SET(used,false);
                        int hc=0;
                        for(auto &x:adj[h]){
                            if(hc>=head_count)break;
                            if( x==t )continue;
                            if( marked2[x] )continue;
                            used[x]=true;

                            cout<<x<<' ';
                            ++hc;
                        }
                        for(auto &x:adj[t]){
                            if(hc>=head_count)break;
                            if( !used[x] ){
                                if( marked2[x]==true ){
                                    cout<<x<<' ';
                                    used[x]=true;
                                    ++hc;
                                }
                            }
                        }line;

                        int tc=0;
                        for(auto &x:adj[t]){
                            if(tc>=tail_count)break;
                            if( x==h )continue;
                            if( used[x])continue;
                            cout<<x<<' ';
                            ++tc;
                        }line;

                        return ;
                    }

                    marked1[t]=true;
                }
            }
        }
    }


    puts("NO");
}
int main() {
        int kase = 1;
#if defined( xerxes_pc )
        if (!freopen("in1", "r", stdin))
                puts("error opening file in "), assert(0);
        kase = 1;
#endif
        fo(i,kase){
                read();
                proc();
        }
        return 0;
}
